Lifting Bell inequalities
نویسنده
چکیده
A Bell inequality defined for a specific experimental configuration can always be extended to a situation involving more observers, measurement settings, or measurement outcomes. In this article, such “liftings” of Bell inequalities are studied. It is shown that if the original inequality defines a facet of the polytope of local joint outcome probabilities then the lifted one also defines a facet of the more complex polytope. © 2005 American Institute of Physics. fDOI: 10.1063/1.1928727g
منابع مشابه
Generating facets for the cut polytope of a graph by triangular elimination
The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of the facets of the cut polytope of the complete bipartite graph or, more generally, the complete k-partite graph. Lifting is a central tool to ...
متن کاملLifted flow cover inequalities for mixed 0-1 integer programs
We investigate strong inequalities for mixed 0-1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger inequalities. However, because of the sequential nature of the standard lifting techniques and the complexity of the optimization problems that have to be solved to obtain lifting coefficients, lif...
متن کاملLifting inequalities for polytopes
We present a method of lifting linear inequalities for the flag f -vector of polytopes to higher dimensions. Known inequalities that can be lifted using this technique are the non-negativity of the toric g-vector and that the simplex minimizes the cd-index. We obtain new inequalities for 6-dimensional polytopes. In the last section we present the currently best known inequalities for dimensions...
متن کاملLifting Cover Inequalities for the Binary Knapsack Polytope
We consider the family of facets of the binary knapsack polytope from minimal covers. We study previous results on sequential lifting in a unifying framework and explore a class of most violated fractional lifted cover inequalities, defined by Balas and Zemel, which are more general than traditional simple lifted cover inequalities. We investigate some theoretical properties of these inequaliti...
متن کاملThe Symmetric Traveling Salesman Polytope Revisited
We propose in this paper a tour of the symmetric traveling salesman polytope, focusing on inequalities that can be deened on sets. The most known inequalities are all of this type. Many papers have appeared which give more and more complex valid inequalities for this polytope, but no intuitive idea on why these inequalities are valid has ever been given. In order to help in understanding these ...
متن کامل